منابع مشابه
Average Distance and Independence Number
A sharp upper bound on the average distance of a graph depending on the order and the independence number is given. As a corollary we obtain the maximum average distance of a graph with given order and matching number. All extremal graphs are determined.
متن کاملDomination and Signed Domination Number of Cayley Graphs
In this paper, we investigate domination number as well as signed domination numbers of Cay(G : S) for all cyclic group G of order n, where n in {p^m; pq} and S = { a^i : i in B(1; n)}. We also introduce some families of connected regular graphs gamma such that gamma_S(Gamma) in {2,3,4,5 }.
متن کاملEdge 2-rainbow domination number and annihilation number in trees
A edge 2-rainbow dominating function (E2RDF) of a graph G is a function f from the edge set E(G) to the set of all subsets of the set {1,2} such that for any edge.......................
متن کاملLower Bounds on the Distance Domination Number of a Graph
For an integer k ≥ 1, a (distance) k-dominating set of a connected graph G is a set S of vertices of G such that every vertex of V (G) \ S is at distance at most k from some vertex of S. The k-domination number, γk(G), of G is the minimum cardinality of a k-dominating set of G. In this talk, we establish lower bounds on the k-domination number of a graph in terms of its diameter, radius and gir...
متن کاملBounds on the Distance Two-Domination Number of a Graph
For a graph G = (V , E), a subset D V ðGÞ is said to be distance two-dominating set in G if for each vertex u 2 V D, there exists a vertex v 2 D such that dðu; vÞ 2. The minimum cardinality of a distance two-dominating set in G is called a distance twodomination number and is denoted by c2ðGÞ. In this note we obtain various upper bounds for c2ðGÞ and characterize the classes of graphs attaining...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1997
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(97)00067-x